A new computational decoding complexity measure of convolutional codes
نویسندگان
چکیده
منابع مشابه
A new computational decoding complexity measure of convolutional codes
This paper presents a computational complexity measure of convolutional codes well suitable for software implementations of the Viterbi algorithm (VA) operating with hard decision. We investigate the number of arithmetic operations performed by the decoding process over the conventional and minimal trellis modules. A relation between the complexity measure defined in this work and the one defin...
متن کاملNew optimal hard decoding of convolutional codes with reduced complexity
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under ce...
متن کاملLow complexity algorithm for soft decoding of convolutional codes
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose a soft decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, performance close...
متن کاملVariable-complexity trellis decoding of binary convolutional codes
We consider trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best accord...
متن کاملLow Complexity Algorithm for Optimal Hard Decoding of Convolutional Codes
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2014
ISSN: 1687-6180
DOI: 10.1186/1687-6180-2014-173